Optimal scheduling of service requirements with a DHR tail in the M/G/1 queue
نویسندگان
چکیده
We consider the mean delay optimization in the M/G/1 queue for service time distributions that have a tail with decresing hazard rate (DHR). If the DHR property is valid for the whole distribution, then it is known that the ForegroundBackground (FB) discipline, which gives full priority to the job with least amount of attained service, is optimal among nonanticipating scheduling disciplines. However, FB may fail to be optimal if the DHR property is valid only for the tail of the distribution. An important example is the Pareto distribution bounded away from zero. In this paper we show that for a wide class of service time distributions with a DHR tail (including the Pareto distribution), the optimal nonanticipating discipline is a combination of FCFS and FB disciplines, which gives full priority to the jobs with attained service less than some fixed threshold θ∗. These priority jobs are served in the FCFS manner. If there are no jobs with attained service less than θ ∗, the full priority is given to the job with least amount of attained service.
منابع مشابه
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue
We consider the mean delay optimization in the M/G/1 queue for jobs with a service time distribution that has a tail with decreasing hazard rate (DHR). If the DHR property is valid for the whole distribution, then it is known that the Foreground-Background (FB) discipline, which gives priority to the job with least amount of attained service, is optimal among nonanticipating scheduling discipli...
متن کاملApproximately optimal scheduling of an M/G/1 queue with heavy tails
Distributions with a heavy tail are difficult to estimate. If the design of an optimal scheduling policy is sensitive to the details of heavy tail distributions of the service times, an approximately optimal solution is difficult to obtain. This paper shows that the optimal scheduling of an M/G/1 queue with heavy tailed service times does not present this difficulty and that an approximately op...
متن کاملA Novel Fuzzy Logic Base Scheduling Mechanism for Service Differentiation in IP Networks
Quality of Service (QoS) refers to a set of rules or techniques that help the network administrators use the available network resources optimally to manage the effects of congestion and to treat the applications according to their needs. The differentiated services architecture (DiffServ) allows providing quality of service to users. The major DiffServ premise is that individual flows with sim...
متن کاملOptimization of M G 1 Queue with Vacation (TECHNICAL NOTE)
This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007